Solving NP-Complete Problems With Networks of Evolutionary Processors
نویسندگان
چکیده
We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An NP-complete problem is solved by networks of evolutionary processors of linear size in linear time. Some furher directions of research are finally discussed. ∗Research supported by the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97–00110508
منابع مشابه
On the size complexity of hybrid networks of evolutionary processors
The goal of this paper is twofold. Firstly, to survey in a systematic and uniform way the main results regarding the size descriptional complexity measures of hybrid networks of evolutionary processors as generating devices. Secondly, we improve some results about the size measure, prove that it is connected, and discuss the possibility of computing this measure for regular and context-free lan...
متن کاملNetworks of Evolutionary Processors: A Survey
The goal of this paper is to survey, in a uniform and systematic way, the main results regarding networks of evolutionary processors reported so far. First, we recall the results concerning the computational power of these networks viewed as language generating devices. Then, we briefly present a few NP-complete problems and recall how they were solved in linear time by networks of evolutionary...
متن کاملString Assembly in Networks of Evolutionary Processors
In this paper, we introduce a new way of communication in networks of evolutionary processors (NEPs) where the filtered communicated strings are appended according to different variants of the overlap operation. These NEPs aim at modelling self-assembly in complex biological systems. We show that these networks with three nodes are computationally complete devices, furthermore they are able to ...
متن کاملNetworks of Evolutionary Processors (nep) as Decision Support Systems
This paper presents the application of Networks of Evolutionary Processors to Decision Support Systems, precisely Knowledge-Driven DSS. Symbolic information and rule-based behavior in Networks of Evolutionary Processors turn out to be a great tool to obtain decisions based on objects present in the network. The non-deterministic and massive parallel way of operation results in NP-problem solvin...
متن کاملAccepting networks of splicing processors: Complexity results
In this paper we consider a new, bio-inspired computing model: the accepting network of splicing processors. We define two computational complexity classes based on this model and show how they are related to the classical ones defined for Turing machines, namely NP and PSPACE. Furthermore, we approach the topic of problem solving using these newly defined devices. In this context, a linear tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001